package com.arron.algorithm.leetcodetop100.二分查找;

/**
 * 35. 搜索插入位置
 */
public class 搜索插入位置 {



    public int searchInsert(int[] nums, int target) {

        int left = 0,right = nums.length-1;

        while (left<=right){

            int mid = left+(right-left)/2;
            if (nums[mid] == target){
                return mid;
            }else if(nums[mid] <target){
                left = mid+1;
            }else if(nums[mid] > target){
                right = mid-1;
            }
        }

        return left;
    }


}
